Plan Recovery in Reactive HTNs Using Symbolic Planning
نویسندگان
چکیده
Building formal models of the world and using them to plan future action is a central problem in artificial intelligence. In this work, we combine two well-known approaches to this problem, namely, reactive hierarchical task networks (HTNs) and symbolic linear planning. The practical motivation for this hybrid approach was to recover from breakdowns in HTN execution by dynamically invoking symbolic planning. This work also reflects, however, on the deeper issue of tradeoffs between procedural and symbolic modeling. We have implemented our approach in a system that combines a reactive HTN engine, called Disco, with a STRIPS planner implemented in Prolog, and conducted a preliminary evaluation.
منابع مشابه
From Plan Traces to Hierarchical Task Networks Using Reinforcements: A Preliminary Report
A key challenge of automated planning is the requirement of a domain expert to provide some sort of background planning knowledge about the dynamics of the planning domain. At a minimum, classical planners require semantic descriptions (i.e., preconditions and effects) of possible actions. More recent planning paradigms allow or require the expert to provide additional knowledge about the struc...
متن کاملProbabilistic hierarchical planning over MDPs
In this paper, we propose a new approach to using probabilistic hierarchical task networks (HTNs) as an effective method for agents to plan in conditions in which their problem-solving knowledge is uncertain, and the environment is non-deterministic. In such situations it is natural to model the environment as a Markov decision process (MDP). We show that using Earley graphs, it is possible to ...
متن کاملTowards Integrating Hierarchical Goal Networks and Motion Planners to Support Planning for Human Robot Collaboration in Assembly Cells
Low-level motion planning techniques must be combined with high-level task planning formalisms to generate realistic plans that can be carried out by humans and robots. A representative example is planning for fenceless assembly cells where robots can collaborate seamlessly with humans to perform assembly tasks. Key constituent components include assembly sequence generation (Morato, Kaipa, and...
متن کاملDurative Planning in HTNs
This paper provides techniques for hierarchical task network (HTN) planning with durative actions. HTNs can provide useful heuristic guidance to planners, express goals that cannot be expressed in simple first principles planners, and allow plan generation to be limited by external constraints. The decomposition information in HTN plans can also help guide plan execution. This paper provides a ...
متن کاملHOPPER: a hierarchical planning agent for unpredictable domains
Hierarchical Task Networks (HTNs) are a family of powerful planning algorithms that have been successfully applied to many complex, real-world domains. However, they are limited to predictable domains. In this paper we present HOPPER (Hierarchical Ordered Partial-Plan Executor and Re-planner), a hierarchical planning agent that produces partial plans in a similar way to HTNs but can also handle...
متن کامل